منابع مشابه
Towards an Efficient Structural Analysis of Colored Petri Nets
This paper presents the Backward reachability which is a structural analysis method applicable to Colored Petri Nets (CPN). This method avoids the fastidious computation of simulation and the combinatorial explosion of reachable state space. The backward reachability provides the information about different ways of reaching a particular CPN marking. This evaluation considers the evolution of ma...
متن کاملIdentification of Colored Components Produced in Sugar Beet Processing Using Gel-Permeation Chromatography (GPC) with UV and RI Detection
Sugar juices in the production of beet sugar contain complex varieties of colored materials that have not been identified completely. Color of the sugar depends the color of juices from which sugar is produced. The mechanisms concerning color formation in beet sugar processing are complicated due to many parameters involved. The main mechanisms related to the color formation during purification...
متن کاملSection VI. Sol-gel processes STRUCTURAL EVOLUTION DURING THE GEL TO GLASS
We have used differential scanning calorimetry (DSC) to measure quantitatively enthalpic changes which accompany gel densification and have related these changes to the evolving gel structure using Raman spectroscopy, gas adsorption, and thermal analysis. We show that the network structure, which results principally from skeletal dehydration (via condensation) during gel densification, is consi...
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Photopolymer Science and Technology
سال: 2009
ISSN: 0914-9244,1349-6336
DOI: 10.2494/photopolymer.22.123